The Complexity of Approximately Counting Retractions
نویسندگان
چکیده
منابع مشابه
The Complexity of Approximately Counting Stable Matchings
We investigate the complexity of approximately counting stable matchings in the k-attribute model, where the preference lists are determined by dot products of “preference vectors” with “attribute vectors”, or by Euclidean distances between “preference points“ and “attribute points”. Irving and Leather [16] proved that counting the number of stable matchings in the general case is #P -complete....
متن کاملThe Complexity of Approximately Counting Stable Roommate Assignments
We investigate the complexity of approximately counting stable roommate assignments in two models: (i) the k-attribute model, in which the preference lists are determined by dot products of “preference vectors” with “attribute vectors” and (ii) the k-Euclidean model, in which the preference lists are determined by the closeness of the “positions” of the people to their “preferred positions”. Ex...
متن کاملApproximately counting cliques
We present a very simple, randomized approximation algorithm for determining the number of cliques in a random graph. Supported in part by NSF Grant CCR-9505448 and a UC Berkeley Faculty Research Grant
متن کاملthe effect of task complexity on lexical complexity and grammatical accuracy of efl learners’ argumentative writing
بر اساس فرضیه شناخت رابینسون (2001 و 2003 و 2005) و مدل ظرفیت توجه محدود اسکهان (1998)، این تحقیق تاثیر پیچیدگی تکلیف را بر پیچیدگی واژگان و صحت گرامری نوشتار مباحثه ای 60 نفر از دانشجویان زبان انگلیسی بررسی کرد. میزان پیچیدگی تکلیف از طریق فاکتورهای پراکندگی-منابع تعیین شد. همه ی شرکت کنندگان به صورت نیمه تصادفی به یکی از سه گروه: (1) گروه موضوع، (2) گروه موضوع + اندیشه و (3) گروه موضوع + اندی...
15 صفحه اولCounting Triangulations Approximately
We consider the problem of counting straight-edge triangulations of a given set P of n points in the plane. Until very recently it was not known whether the exact number of triangulations of P can be computed asymptotically faster than by enumerating all triangulations. We now know that the number of triangulations of P can be computed in O∗(2n) time [2], which is less than the lower bound of Ω...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Computation Theory
سال: 2020
ISSN: 1942-3454,1942-3462
DOI: 10.1145/3397472